Randomness extraction and asymptotic Hamming distance
نویسندگان
چکیده
We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-Löf random in asymptotic Hamming distance. Our result is that the class of stochastically bi-immune sets is not Medvedev reducible to the class of sets having complex packing dimension 1.
منابع مشابه
Recovering randomness from an asymptotic Hamming distance
A notion of asymptotic Hamming distance suitable for the study of algorithmic randomness is developed. As an application of this notion, it is shown that there is no fixed procedure that computes a Mises-WaldChurch stochastic set from a complex set. Here a set is complex if its prefixes have Kolmogorov complexity bounded below by an unbounded, nondecreasing computable function.
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملSpectral Distribution of Pseudo-random Matrices
In the previous century, much work has been done on the spectra of random matrices. However, not much is known about the spectra of matrices formed from pseudo-random sequences. In this talk, I will discuss some of our recent results (jointly with Behtash Babadi) in this direction. First, we consider a binary linear block code C of length N , dimension k and minimum Hamming distance d over GF(2...
متن کاملFuzzy Extractors and Cryptography, or How to Use Your Fingerprints
We provide formal definitions and efficient secure techniques for • turning biometric information into keys usable for any cryptographic application, and • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed un...
متن کاملA generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turán’s theorem to the graph with vertex set {0, 1, . . . , q − 1}n in which two vertices are joined if and only if their Hamming distance is at least d. We generalize the GV bound by applying Turán’s theorem to the graph with v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010